Maximum diameter of 3‐ and 4‐colorable graphs
نویسندگان
چکیده
Erdős et al. made conjectures for the maximum diameter of connected graphs without a complete subgraph K k + 1 ${K}_{k+1}$ , which have order n $n$ and minimum degree δ $\delta $ . Settling weaker version problem, by strengthening -free condition to $k$ -colorable, we solve problem = 3 $k=3$ 4 $k=4$ using unified linear programming duality approach. The case is substantial simplification result Czabarka
منابع مشابه
Oriented diameter of graphs with diameter 3
In 1978, Chvátal and Thomassen proved that every 2-edge-connected graph with diameter 2 has an orientation with diameter at most 6. They also gave general bounds on the smallest value f(d) such that every 2-edge-connected graph G with diameter d has an orientation with diameter at most f(d). For d = 3, their general bounds reduce to 8 ≤ f(3) ≤ 24. We improve these bounds to 9 ≤ f(3) ≤ 11.
متن کاملThe maximum genus of diameter three graphs
The maximum gen'us of connected of orient able surface on which G has 2-ce11 C:U.UYC;UUULl.".. to 2,M(G) where (3(G) the Betti n'umber of G.
متن کاملMaximum degree in graphs of diameter 2
The purpose of this paper is to prove that, with the exception of C 4 , there are no graphs of diameter 2 and maximum degree d with d 2 vertices . On one hand our paper is an extension of [4] where it was proved that there are at most four Moore graphs of diameter 2 (i .e . graphs of diameter 2, maximum degree d, and d2 + 1 vertices) . We also use the eigenvalue method developed in that paper ....
متن کاملDiameter and connectivity of 3-arc graphs
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a given graph G, X(G), is defined to have vertices the arcs of G. Two arcs uv, xy are adjacent in X(G) if and only if (v, u, x, y) is a 3-arc of G. This notion was introduced in recent studies of arc-transitive graphs. In this...
متن کاملMoore Graphs of Diameter 2 and 3
In [1], the authors prove that for k = 2, there exists unique Moore graphs of type (2, 2), (3, 2) and (7, 2). Moreover, they show that only other possible (d, 2) graph is (57, 2), but could not confirm its existence. For k = 3, the authors show that the only Moore graph is (2, 3) and it is unique. Amazingly, the existence of the (57, 2) graph remains an open problem to this day. To prove these ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2022
ISSN: ['0364-9024', '1097-0118']
DOI: https://doi.org/10.1002/jgt.22869